Drawing Graphs and Maps with Curves

نویسندگان

  • Stephen Kobourov
  • Martin Nöllenburg
  • Monique Teillaud
  • Benjamin Niedermann
  • George W. Bush
  • Jackson Stevens
چکیده

This report documents the program and the outcomes of Dagstuhl Seminar 13151 “Drawing Graphs and Maps with Curves”. The seminar brought together 34 researchers from different areas such as graph drawing, information visualization, computational geometry, and cartography. During the seminar we started with seven overview talks on the use of curves in the different communities represented in the seminar. Abstracts of these talks are collected in this report. Six working groups formed around open research problems related to the seminar topic and we report about their findings. Finally, the seminar was accompanied by the art exhibition Bending Reality: Where Arc and Science Meet with 40 exhibits contributed by the seminar participants. Seminar 07.–12. April, 2013 – www.dagstuhl.de/13151 1998 ACM Subject Classification I.3.5 Computational Geometry and Object Modeling, G.2.2 Graph Theory, F.2.2 Nonnumerical Algorithms and Problems

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Drawing Metro Maps Using Bézier Curves

The automatic layout of metro maps has been investigated quite intensely over the last few years. Previous work has focused on the octilinear drawing style where edges are drawn horizontally, vertically, or diagonally at 45◦. Inspired by manually created curvy metro maps, we advocate the use of the curvilinear drawing style; we draw edges as Bézier curves. Since we forbid metro lines to bend (e...

متن کامل

Sphere Anchored Map: A Visualization Technique for Bipartite Graphs in 3D

Circular anchored maps have been proposed as a drawing technique to acquire knowledge from bipartite graphs, where nodes in one set are arranged on a circumference. However, the readability decreases when large-scale graphs are drawn. To maintain the readability in drawing large-scale graphs, we developed “sphere anchored maps,” in which nodes in one set are arranged on a sphere. We describe th...

متن کامل

A New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity

Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...

متن کامل

Logarithmic Curvature and Torsion Graphs

This paper introduces logarithmic curvature and torsion graphs for analyzing planar and space curves. We present a method for drawing these graphs from any differentiable parametric curves and clarify the characteristics of these graphs. We show several examples of theses graphs drawn from planar and 3D Bézier curves. From the graphs, we can see some interesting properties of curves that cannot...

متن کامل

Visual Analysis Tool for Bipartite Networks

To find hidden features of co-authoring relationships, we focused on drawing techniques for bipartite graphs. We previously developed a drawing method called “anchored maps”, which is used to depict bipartite graphs visually. In anchored maps, some nodes are restricted to certain positions, but others are left to be arranged freely. In this study, we used our method to depict co-authoring relat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013